On the Performance of Bytecode Interpreters in Prolog

The semantics and the recursive execution model of Prolog make it very natural to express language interpreters in form AST (Abstract Syntax Tree) where follows tree representation a program. An alternative implementation technique is that bytecode interpreters. These transform program into compact linear before evaluating are generally considered be faster better use resources.